SIMULATION-BASED ONLINE SCHEDULING IN A MAKE-TO-ORDER JOB SHOP
نویسندگان
چکیده
منابع مشابه
Scheduling in a Make - to - Order Job Shop
Scheduling is a core activity in the manufacturing business. It assists with the efficient and effective utilisation of capital-intensive resources and increased throughput, thus increasing profitability. Simulation is appealing in manufacturing, as it can realistically imitate dynamic, stochastic processes while being descriptive in predicting the future process. We combined simulation and sch...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملA Simulation-Optimization Model For Capacity Coordination In Make To Stock/Make To Order Production Environments
Capacity coordination, as the tactical level of hierarchical production planning in hybrid MTS/MTO systems, includes numerous important decisions. In this paper, two of these decisions i.e. finding the best strategy for the acceptance/rejection of incoming orders and determining orders’ due dates – are investigated. Also a simulation model is proposed to evaluate the efficiency of the presented...
متن کاملLearning-based Scheduling in a Job Shop
A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no one rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would t...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The South African Journal of Industrial Engineering
سال: 2009
ISSN: 1012-277X
DOI: 10.7166/20-2-770